Stochastic Deliberation Scheduling using GSMDPs

نویسنده

  • Kurt D. Krebsbach
چکیده

We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDPs). In particular, we use GSMDPs to more accurately model domains in which planning and execution occur concurrently, planimprovement actions have uncertain effects and duration, and events (such as threats) occur asynchronously and stochastically. We demonstrate a significant improvement in expressibility over previous discrete-time approximate models in which mission phase duration was fixed, failure events were synchronized with phase transitions, and planning time was discretized into constant-size planning quanta.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deliberation Scheduling for Time-Critical Scheduling in Stochastic Domains

In this work we explore the use of deliberation scheduling for allocating computation among competing decision procedures in solving time-critical scheduling problems in stochastic domains. We present a two-level deliberation scheduling solution. At the higher level deliberation scheduling is used to partition innnite horizon scheduling problems temporally and sequence and allot computation tim...

متن کامل

Other Agents' Actions as Asynchronous Events

An individual planning agent does not generally have sufficient computational resources at its disposal to produce an optimal plan in a complex domain, as deliberation itself requires and consumes scarce resources. This problem is further exacerbated in a distributed planning context in which multiple, heterogeneous agents must expend a portion of their resource allotment on communication, nego...

متن کامل

Uncertainty in AI , 1993 Deliberation Scheduling for Time - CriticalSequential Decision

We describe a method for time-critical decision making involving sequential tasks and stochastic processes. The method employs several iterative reenement routines for solving diierent aspects of the decision making problem. This paper concentrates on the meta-level control problem of deliberation scheduling, allocating computational resources to these routines. We provide different models corr...

متن کامل

Operating Room Scheduling in Teaching Hospitals: A Novel Stochastic Optimization Model

Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...

متن کامل

Solving Time-critical Decision-making Problems with Predictable Computational Demands

In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amount of time available for processing difficult combinatorial tasks. Our approach uses predictable variability in computational demands to allocate on-line deliberation time and exploits problem regularity and stochastic models of environmental dynamics t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006